Huge tables are fixed parameter tractable via unimodular integer Caratheodory

The three-way table problem is to decide if there exists an l × m × n table satisfying given line sums, and find a table if yes. Recently, it was shown to be fixed-parameter tractable with parameters l, m. Here we extend this and show that the huge version of the problem, where the variable side n is encoded in binary, is also fixed-parameter tractable with parameters l, m. We also conclude that the huge multicommodity flow problem with a huge number of consumers is fixed-parameter tractable. One of our tools is a theorem about unimodular monoids which is of interest on its own right.